Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate
نویسندگان
چکیده
منابع مشابه
The Almost Sure Convergence for Weighted Sums of Linear Negatively Dependent Random Variables
In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...
متن کاملAlmost sure convergence of weighted sums of independent random variables
Let (Ω,F ,P) be a probability space, and let {Xn} be a sequence of integrable centered i.i.d. random variables. In this paper we consider what conditions should be imposed on a complex sequence {bn} with |bn| → ∞, in order to obtain a.s. convergence of P n Xn bn , whenever X1 is in a certain class of integrability. In particular, our condition allows us to generalize the rate obtained by Marcin...
متن کاملTHE ALMOST SURE CONVERGENCE OF WEIGHTED SUMS OF NEGATIVELY DEPENDENT RANDOM VARIABLES
In this paper we study the almost universal convergence of weighted sums for sequence {x ,n } of negatively dependent (ND) uniformly bounded random variables, where a, k21 is an may of nonnegative real numbers such that 0(k ) for every ?> 0 and E|x | F | =0 , F = ?(X ,…, X ) for every n>l.
متن کاملAlmost sure convergence, convergence in probability and asymptotic normality
In the previous chapter we considered estimator of several different parameters. The hope is that as the sample size increases the estimator should get ‘closer’ to the parameter of interest. When we say closer we mean to converge. In the classical sense the sequence {xk} converges to x (xk → x), if |xk − x| → 0 as k → ∞ (or for every ε > 0, there exists an n where for all k > n, |xk − x| < ε). ...
متن کاملJakimovski Methods and Almost-Sure Convergence
The classical summability methods of Borel (B) and Euler (E(λ), λ > 0) play an important role in many areas of mathematics. For instance, in summability theory they are perhaps the most important methods other than the Cesàro (Cα) and Abel (A) methods, and two chapters of the classic book of Hardy (1949) are devoted to them. In probability, the distinction between methods of Cesàro-Abel and Eul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2020
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2019.2929206